Forced orientation of graphs
نویسندگان
چکیده
The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994. If, for a given assignment of directions to a subset S of the edges of a graph G, there exists an orientation of E(G) \ S, so that the resulting graph is strongly connected, then that given assignment is said to be extendible to a strong orientation of G. The forced strong orientation number fD(G), with respect to a strong orientation D of G, is the smallest cardinality among the subsets of E(G) to which the assignment of orientations from D, can be uniquely extended to E. We use the term defining set instead of “forced orientation” to be consistent with similar concepts in other combinatorial objects. It is shown that any minimal strong orientation defining set is also smallest. We also study Spec(G), the spectrum of G, as the set of all possible values for fD(G), where D is taken over all strong orientations of G.
منابع مشابه
Perception of Gradient in Haptic Graphs by Sighted and Visually Impaired Subjects
We report an experiment that presented visually impaired and sighted users with virtually rendered haptic two-line graphs of various orientations. Participants made a forced-choice decision on whether a stimulus was convergent, parallel, or divergent. The use of complex linear haptic graphs was investigated. Possible variations in performance patterns for overall two-line orientations of 0 (ver...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملNew skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملOrientation distance graphs revisited
The orientation distance graph Do(G) of a graph G is defined as the graph whose vertex set is the pair-wise non-isomorphic orientations of G, and two orientations are adjacent iff the reversal of one edge in one orientation produces the other. Orientation distance graphs was introduced by Chartrand et al. in 2001. We provide new results about orientation distance graphs and simpler proofs to ex...
متن کامل